Implementation of Huffman Image Compression And Decompression Algorithm
نویسندگان
چکیده
Compression is used about everywhere. Images are very important documents nowadays; to work with them in some applications they need to be compressed, more or less depending on the purpose of the application. There are various algorithms that performs this compression in different ways; some are lossless and keep the same information as the original image, some others loss information when compressing the image. In this paper I have been working with Huffman lossless compression algorithms for different grayscale images. I have seen how well the different format work for each of the images. The compression ratio (CR) and peak signal to noise ratio (PSNR) are obtained for different images.
منابع مشابه
Implementation of VlSI Based Image Compression Approach on Reconfigurable Computing System - A Survey
Image data require huge amounts of disk space and large bandwidths for transmission. Hence, imagecompression is necessary to reduce the amount of data required to represent a digital image. Thereforean efficient technique for image compression is highly pushed to demand. Although, lots of compressiontechniques are available, but the technique which is faster, memory efficient and simple, surely...
متن کاملLossless Image Compression and Decompression Using Huffman Coding
This paper propose a novel Image compression based on the Huffman encoding and decoding technique. Image files contain some redundant and inappropriate information. Image compression addresses the problem of reducing the amount of data required to represent an image. Huffman encoding and decoding is very easy to implement and it reduce the complexity of memory. Major goal of this paper is to pr...
متن کاملPerformance Analysis of Huffman Coding Algorithm
Huffman coding is such a widespread method for creating prefix-free codes. Huffman code is used as a synonym for prefix-free code even when such a code is not produced by Huffman's algorithm. Huffman coding is an efficient source coding algorithm for source symbols that are not equally probable. It yields the smallest possible number of code symbols per source symbol [7]. In this paper, the Los...
متن کاملThe Jpeg Image Compression Algorithm
The basis for the JPEG algorithm is the Discrete Cosine Transform (DCT) which extracts spatial frequency information from the spatial amplitude samples. These frequency components are then quantized to eliminate the visual data from the image that is least perceptually apparent, thereby reducing the amount of information that must be stored. The redundant properties of the quantized frequency s...
متن کاملImage Compression with Scalable Roi Using Adaptive Huffman Coding
Most of the commercial medical image viewers do not provide scalability in image compression and/or encoding/decoding of region of interest (ROI). This paper discusses a medical application that contains a viewer for digital imaging and communications in medicine (DICOM) images as a core module. The proposed application enables scalable wavelet-based compression, retrieval, and decompression of...
متن کامل